Fast reliability ranking of matchstick minimal networks

Fast Feature Ranking Algorithm

The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simpler and easy to understand. The algorithm has some interesting characteristics: lower computational cost (O(m n log n) m attributes and n examples in the data set) with respect to other typical algorithms due to the abse...

A catalog of matchstick graphs

Classification of planar unit-distance graphs with up to 9 edges, by homeomorphism and isomorphism classes. With exactly nine edges, there are 633 nonisomorphic connected matchstick graphs, of which 19 are topologically distinct from each other. Increasing edges' number, their quantities rise more than exponentially, in a still unclear way.

Regular Matchstick Graphs

A matchstick graph is a plane geometric graph in which every edge has length 1 and no two edges cross each other. It was conjectured that no 5-regular matchstick graph exists. In this paper we prove this conjecture.

Ranking stochastic efficient DMUs based on reliability

Ranking Networks

Latent space models for network formation assume that nodes possess latent attributes that determine their propensity to connect. We propose a new model for network formation, ranking networks, in which these attributes are rankings over some space of alternatives. Such rankings may reflect user preferences, relevance/quality judgements, etc., while ranking networks capture correlations of, say...